modeling and scheduling no-idle hybrid flow shop problems

Authors

mehdi yazdani

department of industrial engineering, faculty of industrial and mechanical engineering, islamic azad university, qazvin branch, qazvin, iran bahman naderi

department of industrial engineering, faculty of engineering, kharazmi university, tehran, iran

abstract

although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. but, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. this paper considers the problem of scheduling no-idle hybrid flow shops. a mixed integer linear programming model is first developed to mathematically formulate the problem. using commercial software, the model can solve small instances to optimality. then, two metaheuristics based on variable neighborhood search and genetic algorithms are developed to solve larger instances. using numerical experiments, the performance of the model and algorithms are evaluated.although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. but, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. this paper considers the problem of scheduling no-idle hybrid flow shops. a mixed integer linear programming model is first developed to mathematically formulate the problem. using commercial software, the model can solve small instances to optimality. then, two metaheuristics based on variable neighborhood search and genetic algorithms are developed to solve larger instances. using numerical experiments, the performance of the model and algorithms are evaluated.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Modeling and scheduling no-idle hybrid flow shop problems

Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...

full text

A note on flow shop scheduling problems with a learning effect on no-idle dominant machines

This paper considers some permutation flow shop scheduling problems with a learning effect on no-idle dominant machines. The objective is to minimize maximum completion time. This objective is considered under following dominant machines constraint: idm, ddm, idm–ddm and ddm–idm. We present a polynomial-time solution algorithm for each of the above cases. 2006 Elsevier Inc. All rights reserved.

full text

Solving hybrid flow shop scheduling problems using bat algorithm

This paper investigates the multistage hybrid flow shop (HFS) scheduling problems using the new bat algorithm. A HFS is the generalisation of flowshop with multiple machines. HFS is one of the important scheduling problems that represent many industries like iron and steel, chemical, textile and ceramic industries. The HFS scheduling problems have been proved to be NP-hard. A recently developed...

full text

Solving Re-entrant No-wait Flow Shop Scheduling Problem

In this study, we consider the production environment of no-wait reentrant flow shop with the objective of minimizing makespan of the jobs. In a reentrant flow shop, at least one job should visit at least one of the machines more than once. In a no-wait flowshop scheduling problem, when the process of a specific job begins on the first machine, it should constantly be processed without waiting ...

full text

Evolutionary Hybrid Particle Swarm Optimization Algorithm for Solving NP-Hard No-Wait Flow Shop Scheduling Problems

The no-wait flow shop is a flowshop in which the scheduling of jobs is continuous and simultaneous through all machines without waiting for any consecutive machines. The scheduling of a no-wait flow shop requires finding an appropriate sequence of jobs for scheduling, which in turn reduces total processing time. The classical brute force method for finding the probabilities of scheduling for im...

full text

Solving No-Wait Flow Shop Scheduling Problems by a Hybrid Quantum-Inspired Evolutionary Algorithm

This paper is the first to consider the hybrid quantum-inspired evolutionary algorithm (HQEA) on the no-wait permutation flow shop scheduling problem (PFSP) for minimizing the makespan. In this HQEA, the quantum chromosomes are encoded by using the quantum rotating angle and a simple but efficient converting mechanism for determining job sequence is proposed for the representation of solution f...

full text

My Resources

Save resource for easier access later


Journal title:
journal of optimization in industrial engineering

جلد ۱۰، شماره ۲۱، صفحات ۵۹-۶۶

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023